Perfect-Information Stochastic Parity Games
نویسنده
چکیده
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this fact by K. Chatterejee, M. Jurdziński, T.A. Henzinger [2] and A.K. McIver, C.C. Morgan [14] the proof given in this paper proceeds by a straightforward induction on the number of outgoing transitions available to one of the players and is
منابع مشابه
Perfect Information Stochastic Priority Games
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority games only infinite plays are possible and the payoff is a linear combination...
متن کاملStochastic Games with Parity Mean-payoff Objective
In this paper, we compute value of two-player games with perfect information equipped with the Par∧Avg>0 objectives. Moreover we show that even though the optimal strategies may require infinite memory, there exists an NP algorithm that computes the almost-sure region.
متن کاملThe value problem in stochastic games. (Le problème de la valeur dans les jeux stochastiques)
Game theory proved to be very useful in the field of verification of open reactive systems. This is due to the wide variety of games’ model that differ in the way players interact and the amount of information players have. In this thesis, we study the value problem for games where players have full knowledge on their current configuration of the game, partial knowledge, and no knowledge. In th...
متن کاملBlackwell Optimal Strategies in Priority mean-Payoff Games
One of the recurring themes in the theory of stochastic games is the interplay between discounted games and mean-payoff games. This culminates in the seminal paper of Mertens and Neyman [12] showing that mean-payoff games have a value and this value is the limit of the values of discounted games when the discount factor tends to 1. Note however that optimal strategies in both games are very dif...
متن کاملPerfect-Information Stochastic Mean-Payoff Parity Games
The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 2 -player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 212 -player games where the objective of the Sys...
متن کامل